Geometric Pattern Matching Reduces to k -SUM
نویسندگان
چکیده
We prove that some exact geometric pattern matching problems reduce in linear time to k -SUM when the has a fixed size k. This holds real RAM model for searching similar copy of set \(k\ge 3\) points within n plane, and an affine image d+2\) d-space. As corollaries, we obtain improved algorithms decision trees two problems. In particular, they can be solved by algebraic near-linear height.
منابع مشابه
k-Abelian Pattern Matching
Two words are called k-abelian equivalent, if they share the same multiplicities for all factors of length at most k. We present an optimal linear time algorithm for identifying all occurrences of factors in a text that are k-abelian equivalent to some pattern P . Moreover, an optimal algorithm for finding the largest k for which two words are k-abelian equivalent is given. Solutions for online...
متن کاملIndexed Geometric Jumbled Pattern Matching
We consider how to preprocess n colored points in the plane such that later, given a multiset of colors, we can quickly find an axisaligned rectangle containing a subset of the points with exactly those colors, if one exists. We first give an index that uses o(n) space and o(n) query time when there are O(1) distinct colors. We then restrict our attention to the case in which there are only two...
متن کاملGeometric Pattern Matching in d-Dimensional Space
We show that, using the L 1 metric, the minimum Hausdor distance under translation between two point sets of cardinality n in d-dimensional space can be computed in time O(n (4d 2)=3 log 2 n) for 3 < d 8, and in time O(n 5d=4 log 2 n) for any d > 8. Thus we improve the previous time bound of O(n 2d 2 log 2 n) due to Chew and Kedem. For d = 3 we obtain a better result of O(n 3 log 2 n) time by e...
متن کاملApproximate Geometric Pattern Matching Under Rigid Motions
We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal, and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.
متن کاملGeometric Pattern Matching Under Euclidean Motion
Given two planar sets A and B, we examine the problem of determining the smallest " such that there is a Euclidean motion (rotation and translation) of A that brings each member of A within distance " of some member of B. We establish upper bounds on the combinatorial complexity of this subproblem in model-based computer vision, when the sets A and B contain points, line segments, or ((lled-in)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2021
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-021-00324-1